Interactive Graph Layout of a Million Nodes
نویسندگان
چکیده
Sensemaking of large graphs, specifically those with millions of nodes, is a crucial task in many fields. Automatic graph layout algorithms, augmented with real-time human-in-the-loop interaction, can potentially support sensemaking of large graphs. However, designing interactive algorithms to achieve this is challenging. In this paper, we tackle the scalability problem of interactive layout of large graphs, and contribute a new GPU-based force-directed layout algorithm that exploits graph topology. This algorithm can interactively layout graphs with millions of nodes, and support real-time interaction to explore alternative graph layouts. Users can directly manipulate the layout of vertices in a force-directed fashion. The complexity of traditional repulsive force computation is reduced by approximating calculations based on the hierarchical structure of multi-level clustered graphs. We evaluate the algorithm performance, and demonstrate human-in-the-loop layout in two sensemaking case studies. Moreover, we summarize lessons learned for designing interactive large graph layout algorithms on the GPU.
منابع مشابه
Interactive, Constraint-based Layout of Engineering Diagrams
Many engineering disciplines require visualisation of networks. Constrained graph layout is a powerful new approach to network layout that allows the user to impose a wide variety application-specific placement constraints—such as downwards pointing directed edges, alignment of nodes, cluster containment and non-overlapping nodes and clusters—on the layout. We have recently developed an efficie...
متن کاملgraphTPP: A multivariate based method for interactive graph layout and analysis
Graph layout is the process of creating a visual representation of a graph through a node-link diagram. Node-attribute graphs have additional data stored on the nodes which describe certain properties of the nodes called attributes. Typical force-directed representations often produce hairball-like structures that neither aid in understanding the graph’s topology nor the relationship to its att...
متن کاملStable Incremental Layouts for Dynamic Graph Visualizations
In this paper we present a set of extension techniques to stabilize interactive dynamic graph layout algorithms. It works with different existing Focus & Context methods. We first deal with the initial placement of newly inserted nodes to mitigate acting forces in the layout algorithm. Then, their influence on the existing layout is gradually increased to create a smooth transition between the ...
متن کاملEffective Graph Visualization via Node Grouping
visualizes large graphs 2D drawing assumes the existence of complete or almost complete subgraphs in the graph to be visualized use of two type of techniques: force directed orthogonal drawing Levels of Abstraction total abstraction proximity abstraction explicit proximity abstraction interactive abstraction Force Directed Layout Technique with Node Grouping 1. find node grouping (by using the ...
متن کاملLinkScope: Interactive Graph Analysis of Unstructured Text
This paper presents LinkScope, a toolkit for interactive analysis of text using node link graphs, with support for dynamic addition of attributes from tabular data. The interaction technique draws on ideas from 3D modeling, mesh deformation, and static graph drawing to promote discovery of hidden information across a wide variety of graph types and analysis tasks. The key innovation of this wor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Informatics
دوره 3 شماره
صفحات -
تاریخ انتشار 2016